Reinhard Diestel Graph Theory 4 th Electronic Edition 2010
نویسنده
چکیده
This is a sample chapter of the eBook edition of the above Springer book, from their series Graduate Texts in Mathematics, vol. 173. In the English and German edition, the cross-references in the text and in the margins are active links. In this sample chapter, only those links will work that take you to another location in this chapter.
منابع مشابه
Reinhard Diestel Graph Theory 4
The cross-references in the text and in the margins are active links. When you see “Lemma 3.1”, for example, click on the “3.1” to be taken to that lemma. Feel free to print pages from this file for your personal use. If you intend to teach from this book, you may get your Department to purchase an additional “course notes” licence for this file. This will allow you to distribute handouts in cl...
متن کاملEvery rayless graph has an unfriendly partition
We prove that every rayless graph has an unfriendly partition.
متن کاملTwins of rayless graphs
Two non-isomorphic graphs are twins if each is isomorphic to a subgraph of the other. We prove that a rayless graph has either infinitely many twins or none.
متن کاملA universal planar graph under the minor relation
We construct an in nite planar graph that contains every planar graph as a minor.
متن کامل